Comparing Offset Curve Approximation Methods

نویسندگان

  • Gershon Elber
  • In-Kwon Lee
  • Myung-Soo Kim
چکیده

Offset curves have diverse engineering applications, which have consequently motivated extensive research concerning various offset techniques. Offset research in the early 1980s focused on approximation techniques to solve immediate application problems in practice. This trend continued until 1988, when Hoschek [1, 2] applied non-linear optimization techniques to the offset approximation problem. Since then, it has become quite difficult to improve the state-of-the-art of offset approximation. Offset research in the 1990s has been more theoretical. The foundational work of Farouki and Neff [3] clarified the fundamental difficulty of exact offset computation. Farouki and Sakkalis [4] suggested the Pythagorean Hodograph curves which allow simple rational representation of their exact offset curves. Although many useful plane curves such as conics do not belong to this class, the Pythagorean Hodograph curves may have much potential in practice, especially when they are used for offset approximation. In a recent paper [5] on offset curve approximation, the authors suggested a new approach based on approximating the offset circle, instead of approximating the offset curve itself. To demonstrate the effectiveness of this approach, we have made extensive comparisons with previous methods. To our surprise, the simple method of Tiller and Hanson [6] outperforms all the other methods for offsetting (piecewise) quadratic curves, even though its performance is not as good for high degree curves. The experimental results have revealed other interesting facts, too. If these details had been reported several years ago, we believe, offset approximation research might have developed somewhat differently. This paper is intended to fill in an important gap in the literature. Qualitative as well as quantitative comparisons are conducted employing a whole variety of contemporary offset approximation methods for freeform curves in the plane. The efficiency of the offset approximation is measured in terms of the number of control points generated while the approximations are made within a prescribed tolerance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error analysis of reparametrization based approaches for curve offsetting

This paper proposes an error analysis of reparametrization based approaches for planar curve offsetting. The approximation error in Hausdorff distance is computed. The error is bounded by O(r sin2 β), where r is the offset radius and β is the angle deviation of a difference vector from the normal vector. From the error bound an interesting geometric property of the approach is observed: when th...

متن کامل

New Approximation Methods for Planar Offset and Convolution Curves

We present new methods to approximate the offset and convolution of planar curves. These methods can be used as fundamental tools in various geometric applications such as NC machining and collision detection of planar curved objects. Using quadratic curve approximation and tangent field matching, the offset and convolution curves can be approximated by polynomial or rational curves within the ...

متن کامل

PH-spline approximation for Bézier curve and rendering offset.

In this paper, a G(1), C(1), C(2) PH-spline is employed as an approximation for a given Bézier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bézier curve. The errors between PH-spline and the Bézier curve, the offset to PH-spline and the offset to the given Bézier curve are also estimated. A new algorithm for constructing offset to the...

متن کامل

Hausdorff Distance between the Offset Curve of Quadratic Bezier Curve and Its Quadratic Approximation

In this paper, we present the exact Hausdorff distance between the offset curve of quadratic Bézier curve and its quadratic GC1 approximation. To illustrate the formula for the Hausdorff distance, we give an example of the quadratic GC1 approximation of the offset curve of a quadratic Bézier curve. 1. Preliminaries Quadratic Bézier curves and their offset curves are widely used in CAD/CAM or Co...

متن کامل

Polynomial/Rational Approximation of Minkowski Sum Boundary Curves 1

Given two planar curves, their convolution curve is defined as the set of all vector sums generated by all pairs of curve points which have the same curve normal direction. The Minkowski sum of two planar objects is closely related to the convolution curve of the two object boundary curves. That is, the convolution curve is a superset of the Minkowski sum boundary. By eliminating all redundant ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Computer Graphics and Applications

دوره 17  شماره 

صفحات  -

تاریخ انتشار 1997